Binary Intersymbol Interferen e Channels : Gallager Codes , Density Evolution and CodePerforman e Bounds
ثبت نشده
چکیده
منابع مشابه
IRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES Gallager-Type Bounds for Non-Binary Linear Block Codes over Memoryless Symmetric Channels
The performance of non-binary linear block codes is studied in this paper via the derivation of new upper bounds on the error probability under ML decoding. The transmission of these codes is assumed to take place over a memoryless and symmetric channel. The new bounds, which rely on the Gallager bounding technique, are applied to expurgated ensembles of non-binary and regular low-density parit...
متن کاملML and Near-ML Decoding of LDPC Codes Over the BEC: Bounds and Decoding Algorithms
The performance of maximum-likelihood (ML) decoding on the binary erasure channel for finite-length low-density paritycheck (LDPC) codes from two random ensembles is studied. The theoretical average spectrum of the Gallager ensemble is computed by using a recurrent procedure and compared to the empirically found average spectrum for the same ensemble as well as to the empirical average spectrum...
متن کاملGallager codes for CDMA applications .I. Generalizations, constructions, and performance bounds
We focus on applications of low-rate Gallager (low-density parity-check) codes in code-division multiple-access schemes. The codes that we present here achieve good performance with relatively short frame-lengths in additive white Gaussian noise channels and, perhaps more importantly, in fading channels. These codes can be decoded with low complexity by using iterative decoding procedures. We p...
متن کاملML and Near-ML Decoding Performance of LDPC Codes over BEC: Bounds and Decoding Algorithms
Performance of maximum-likelihood (ML) decoding on the binary erasure channel for finite length LDPC codes from two random ensembles is studied. The theoretical average spectrum of the Gallager ensemble is computed by using a recurrent procedure and compared to the empirically found average spectrum for the same ensemble as well as to the empirical average spectrum of the Richardson-Urbanke ens...
متن کاملCoding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New upper bounds on the maximum-likelihood (ML) decoding error probability are derived. These bounds are applied to various ensembles of turbo-like codes, focusing especially on repeat-accumulate codes and their recent va...
متن کامل